Partial match queries in random quadtrees
نویسندگان
چکیده
We propose a simple, direct approach for computing the expected cost of random partial match queries in random quadtrees. The approach gives not only an explicit expression for the leading constant in the asymptotic approximation of the expected cost but also more terms in the asymptotic expansion if desired.
منابع مشابه
Partial Match Queries in Two-dimensional Quadtrees: a Probabilistic Approach
We analyze the mean cost of the partial match queries in random two-dimensional quadtrees. The method is based on fragmentation theory. The convergence is guaranteed by a coupling argument of Markov chains, whereas the value of the limit is computed as the fixed point of an integral equation.
متن کاملStrong Convergence of Partial Match Queries in Random Quadtrees
We prove that the rescaled costs of partial match queries in a random two-dimensional quadtree converge almost surely towards a random limit which is identified as the terminal value of a martingale. Our approach shares many similarities with the theory of self-similar fragmentations.
متن کاملLimit Laws for Partial Match Queries in Quadtrees
It is proved that in an idealized uniform probabilistic model the cost of a partial match query in a multidimensional quadtree after normalization converges in distribution. The limiting distribution is given as a fixed point of a random affine operator. Also a first-order asymptotic expansion for the variance of the cost is derived and results on exponential moments are given. The analysis is ...
متن کاملPartial Match Queries in Relaxed K-dt trees
The study of partial match queries on random hierarchical multidimensional data structures dates back to Ph. Flajolet and C. Puech’s 1986 seminal paper on partial match retrieval. It was not until recently that fixed (as opposed to random) partial match queries were studied for random relaxed K-d trees, random standard K-d trees, and random 2-dimensional quad trees. Based on those results it se...
متن کاملA Limit Process for Partial Match Queries in Random Quadtrees and 2-d Trees by Nicolas Broutin,
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quadtrees and k-d trees). We assume the traditional model where the data consist of independent and uniform points in the unit square. For this model, in a structure on n points, it is known that the number of nodes Cn(ξ) to visit in order to report the items matching a random query ξ ,...
متن کامل